Convergence Results for Generalized Pattern Search Algorithms are Tight

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence Results for Generalized Pattern Search Algorithms are Tight

The convergence theory of generalized pattern search algorithms for unconstrained optimization guarantees under mild conditions that the method produces a limit point satisfying first order optimality conditions related to the local differentiability of the objective function. By exploiting the flexibility allowed by the algorithm, we derive six small dimensional examples showing that the conve...

متن کامل

On the Convergence of Pattern Search Algorithms

We introduce an abstract definition of pattern search methods for solving nonlinear unconstrained optimization problems. Our definition unifies an important collection of optimization methods that neither compute nor explicitly approximate derivatives. We exploit our characterization of pattern search methods to establish a global convergence theory that does not enforce a notion of sufficient ...

متن کامل

On the Convergence of Mixed Integer Pattern Search Algorithms

The deenition of pattern search methods for solving nonlinear uncon-strained optimization problems is generalized here to include integer variables. We present a generalized pattern search algorithm that provides an accumulation point having a null gradient with respect to the continuous variable and being a local minimizer with respect to the discrete variables. This point is the limit of a su...

متن کامل

Generalized Pattern Search and Mesh Adaptive Direct Search Algorithms for Protein Structure Prediction

Proteins are the most interesting molecular entities of a living organism and understanding their function is a an important task to treat diseases and synthesize new drugs. It is largely known that the function of a protein is strictly related to its spatial conformation: to tackle this problem, we have proposed a new approach based on the class of pattern search algorithms that are largely us...

متن کامل

Tight estimates for convergence of some non-stationary consensus algorithms

The present paper is devoted to estimating the speed of convergence towards consensus for a general class of discrete-time multi-agent systems. In the systems considered here, both the topology of the interconnection graph and the weight of the arcs are allowed to vary as a function of time. Under the hypothesis that some spanning tree structure is preserved along time, and that some nonzero mi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optimization and Engineering

سال: 2004

ISSN: 1389-4420

DOI: 10.1023/b:opte.0000033370.66768.a9